Static Timing Analysis Based Transformations of Super-complex Instruction Set Hardware Functions
نویسنده
چکیده
منابع مشابه
Continuity of super- and sub-additive transformations of continuous functions
We prove a continuity inheritance property for super- and sub-additive transformations of non-negative continuous multivariate functions defined on the domain of all non-negative points and vanishing at the origin. As a corollary of this result we obtain that super- and sub-additive transformations of continuous aggregation functions are again continuous aggregation functions.
متن کاملSUPER- AND SUB-ADDITIVE ENVELOPES OF AGGREGATION FUNCTIONS: INTERPLAY BETWEEN LOCAL AND GLOBAL PROPERTIES, AND APPROXIMATION
Super- and sub-additive transformations of aggregation functions have been recently introduced by Greco, Mesiar, Rindone and v{S}ipeky [The superadditive and the subadditive transformations of integrals and aggregation functions, {it Fuzzy Sets and Systems} {bf 291} (2016), 40--53]. In this article we give a survey of the recent development regarding the existence of aggregation functions with ...
متن کاملSuper- and sub-additive transformations of aggregation functions from the point of view of approximation
The way super- and sub-additive transformations of aggregation functions are introduced involve suprema and infima taken over simplexes whose dimensions may grow arbitrarily. Exact values of such transformations may thus be hard to determine in general. In this note we discuss methods of algorithmic approximation of such transformations.
متن کاملAnalysable instruction memories for hard real-time systems
In safety-critical embedded real-time systems the timing behaviour is of highest importance, because applications underlie timing constraints that have to be met. Otherwise the system might fail causing harm to humans, the environment, or the system itself. Therefore, such hard real-time systems have to provide timing guarantees. Since the timing behaviour of the system does not only depend on ...
متن کاملTiming Analysis of Superscalar Processor Programs Using ACSR
This paper illustrates a formal technique for describing the timing properties and resource constraints of pipelined superscalar processor instructions at high level. Superscalar processors can issue and execute multiple instructions simultaneously. The degree of parallelism depends on the multiplicity of hardware functional units as well as data dependencies among instructions. Thus, the timin...
متن کامل